On nested depth first search
نویسندگان
چکیده
We show in this paper that the algorithm for solving the model checking problem with a nested depth-first search can interfere with algorithms that support partial order reduction. We introduce a revised version of the algorithm that guarantees compatibility. The change also improves the performance of the nested depth-first search algorithm when partial order reduction is not used.
منابع مشابه
Depth First Search
Depth-first search of a graph is formalized with function. It is shown that it visits all of the reachable nodes from a given list of nodes. Executable ML code of depth-first search is obtained with code generation feature of Isabelle/HOL. The formalization contains two implementations of depth-first search: one by stack and one by nested recursion. They are shown to be equivalent. The terminat...
متن کاملMulti-core Nested Depth-First Search
The LTL Model Checking problem is reducible to finding accepting cycles in a graph. The Nested Depth-First Search (Ndfs) algorithm detects accepting cycles efficiently: on-the-fly, with linear-time complexity and negligible memory overhead. The only downside of the algorithm is that it relies on an inherently-sequential, depth-first search. It has not been parallelized beyond running the indepe...
متن کامل7. Nested Depth First Search Algorithms for Symmetry Reduction in Model Checking Nested Depth First Search Algorithms for Symmetry Reduction in Model Checking
We propose an algorithm for model checking under weak fairness that exploits symmetry for state space reduction. As intermediate results we also discuss two other algorithms which deal separately with weak fairness and symmetry reduction. The algorithms presented in this chapter are based on the Nested Depth First Search (NDFS) algorithm by Courcoubetis, Vardi, Wolper and Yannakakis. We argue t...
متن کاملAn Experimental Investigation on the Pancake Problem
In this paper, we present an experimental investigation on the pancake problem. Also called sorting by prefix reversals (SBPR), this problem is linked to the genome rearrangement problem also called sorting by reversals (SBR). The pancake problem is a NP-hard problem. Until now, the best theoretical R-approximation was 2 with an algorithm which gives a 1.22 experimental R-approximation on stack...
متن کاملImproved Multi-Core Nested Depth-First Search
This paper presents CNDFS, a tight integration of two earlier multicore nested depth-first search (NDFS) algorithms for LTL model checking. CNDFS combines the different strengths and avoids some weaknesses of its predecessors. We compare CNDFS to an earlier ad-hoc combination of those two algorithms and show several benefits: It has shorter and simpler code and a simpler correctness proof. It e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996